Upper Unidomination Number and Upper Total Unidomination Number of a 3-Regularized Wheel
نویسندگان
چکیده
منابع مشابه
Upper Bounds on the Total Domination Number
A total dominating set of a graph G with no isolated vertex is a set S of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G. In this paper, we present several upper bounds on the total domination number in terms of the minimum degree, diameter, girth and order.
متن کاملThe upper domatic number of powers of graphs
Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...
متن کاملNew results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملWeighted upper domination number
The cardinality of a maximum minimal dominating set of a graph is called its upper domination number. The problem of computing this number is generally NP-hard but can be solved in polynomial time in some restricted graph classes. In this work, we consider the complexity and approximability of the weighted version of the problem in two special graph classes: planar bipartite, split. We also pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018917359